Recognizing Threshold Tolerance Graphs in O(n2) Time
نویسندگان
چکیده
A graph G = (V,E) is a threshold tolerance graph if each vertex v ∈ V can be assigned a weight wv and a tolerance tv such that two vertices x, y ∈ V are adjacent if wx +wy ≥ min(tx, ty). Currently, the most efficient recognition algorithm for threshold tolerance graphs is the algorithm of Monma, Reed, and Trotter which has an O(n) runtime. We give an O(n) algorithm for recognizing threshold tolerance and their complements, the threshold tolerance (co-TT) graphs, resolving an open question of Golumbic, Weingarten, and Limouzy.
منابع مشابه
On recognition of threshold tolerance graphs and their complements
A graph G = (V,E) is a threshold tolerance graph if each vertex v ∈ V can be assigned a weight wv and a tolerance tv such that two vertices x, y ∈ V are adjacent if wx +wy ≥ min(tx, ty). Currently, the most efficient recognition algorithm for threshold tolerance graphs is the algorithm of Monma, Reed, and Trotter which has an O(n) runtime. We give an O(n) algorithm for recognizing threshold tol...
متن کاملA New Intersection Model and Improved Algorithms for Tolerance Graphs
Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree of overlap without being in conflict. This class of graphs, which generalizes in a natural way both interval and permutation graphs, has attracted many research efforts since their introduction in [M. C. Golumbic and C. L. Monma, Congr. Numer., 35 (1982), pp. 321–331], as it finds many important...
متن کاملRecognizing Bipartite Unbounded Tolerance Graphs in Linear Time
A graph G = (V,E) is a tolerance graph if each vertex v ∈ V can be associated with an interval of the real line Iv and a positive real number tv in such a way that (uv) ∈ E if and only if |Iv ∩ Iu| ≥ min(tv, tu). No algorithm for recognizing tolerance graphs in general is known. In this paper we present an O(n+m) algorithm for recognizing tolerance graphs that are also bipartite, where n and m ...
متن کاملLinear-time certifying algorithms for recognizing split graphs and related graph classes∗
We give the first linear-time certifying algorithms to recognize split graphs, threshold graphs, bipartite chain graphs, cobipartite chain graphs and trivially perfect graphs, with sublinear certificates for negative output. In case of membership in a given graph class our algorithms provide as certificate a structure for the input graph that characterizes the class, and in case of non-membersh...
متن کاملNode-to-Set Disjoint Paths Problem in Bi-rotator Graphs
An algorithm is described for solving the node-to-set disjoint paths problem in bi-rotator graphs, which are obtained by making each edge of a rotator graph bi-directional. The algorithm is of polynomial order of n for an n-bi-rotator graph. It is based on recursion and divided into three cases according to the distribution of destination nodes in the classes into which the nodes in a bi-rotato...
متن کامل